Computing Approximate Equilibria in Graphical Games on Arbitrary Graphs
نویسندگان
چکیده
We present PureProp: a new constraint satisfaction algorithm for computing pure-strategy approximate Nash equilibria in complete information games. While this seems quite limited in applicability, we show how PureProp unifies existing algorithms for 1) solving a class of complete information graphical games with arbitrary graph structure for approximate Nash equilibria (Kearns et al., 2001; Ortiz & Kearns, 2003), and 2) solving some classes of incomplete information games with tree-graph structure for approximate Bayes-Nash equilibria (Singh et al., 2004). We also show how PureProp provides a hitherto unavailable algorithm for solving classes of incomplete information graphical games with arbitrary graph structure for approximate Bayes-Nash equilibria, and conclude with some empirical analysis of the new algorithm.
منابع مشابه
Nash Propagation for Loopy Graphical Games
We introduce NashProp, an iterative and local message-passing algorithm for computing Nash equilibria in multi-player games represented by arbitrary undirected graphs. We provide a formal analysis and experimental evidence demonstrating that NashProp performs well on large graphical games with many loops, often converging in just a dozen iterations on graphs with hundreds of nodes. NashProp gen...
متن کاملA Continuation Method for Nash Equilibria in Structured Games
Structured game representations have recently attracted interest as models for multiagent artificial intelligence scenarios, with rational behavior most commonly characterized by Nash equilibria. This paper presents efficient, exact algorithms for computing Nash equilibria in structured game representations, including both graphical games and multi-agent influence diagrams (MAIDs). The algorith...
متن کاملOn Sparse Discretization for Graphical Games
This short paper concerns discretization schemes for representing and computing approximate Nash equilibria, with emphasis on graphical games, but briefly touching on normal-form and poly-matrix games. The main technical contribution is a representation theorem that informally states that to account for every exact Nash equilibrium using a nearby approximate Nash equilibrium on a grid over mixe...
متن کاملTractable Algorithms for Approximate Nash Equilibria in Generalized Graphical Games with Tree Structure
We provide the first fully polynomial time approximation scheme (FPTAS) for computing an approximate mixedstrategy Nash equilibrium in graphical multi-hypermatrix games (GMhGs), which are generalizations of normal-form games, graphical games, graphical polymatrix games, and hypergraphical games. Computing an exact mixed-strategy Nash equilibria in graphical polymatrix games is PPADcomplete and ...
متن کاملGraphical Models for Game Theory
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equilibria in one-stage games represented by trees or sparse graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004